On the Communication Latency of Wormhole Routed Interconnection Networks

نویسندگان

  • A. SHAHRABI
  • M. OULD-KHAOUA
چکیده

Several analytical models have been proposed in the literature for wormhole -routed multicomputers. However, all these models have been discussed in the context of unicast communication and there has been comparatively little activity in the area of analytical modelling of collective communication algorithms like broadcast. To our best knowledge, this paper presents the first analytical model to predict latency of unicast and broadcast messages in wormhole -routed hypercubes with deterministic routing. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Analytical Model for Wormhole Routed Networks with Application to Butterfly Fat-Trees

A performance model for wormhole routed interconnection networks is presented and applied to the butterfly fat-tree network. Experimental results agree very closely over a wide range of load rate. Novel aspects of the model, leading to accurate and simple performance predictions, include (1) use of multiple-server queues, and (2) a general method of correcting queuing results based on Poisson a...

متن کامل

Tree-Based Multicasting on Wormhole-Routed Star Graph Interconnection Networks with Hamiltonian Path

Multicast is an important collective communication operation on multicomputer systems, in which the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In our previous work on wormhole star graph networks routing, we proposed a path-base...

متن کامل

Multicast Communication on Wormhole-Routed Star Graph Interconnection Networks with Tree-Based Approach

Multicast is an important collective communication operation on multicomputer systems, in which the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper, we address an efficient and deadlock-free tree-based multicast routing...

متن کامل

Execution Based Evaluation of Multistage Interconnection Networks for Cache-Coherent Multiprocessors

In this paper, performance of multistage interconnection network with wormhole routing and packet switching has been evaluated for cache-coherent shared-memory multiprocessors. The traac in cache-coherent systems is characterized by traac bursts, one-to-many and many-to-one traac, and small xed length messages. The evaluation is based on execution-driven simulation using various applications. T...

متن کامل

A Performance Evaluation of Fully Adaptive Wormhole Routing including Selection Function Choice

Many adaptive routing algorithms have been proposed for wormhole-routed interconnection networks. Comparatively little work, however, has been done on determining how the selection function affects the performance of an adaptive routing algorithm. In this paper, we present a detailed simulation study of various selection functions for four different fully adaptive wormhole routing algorithms fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003